A Finite Word Poset
نویسندگان
چکیده
Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank and Röhl [4]) and a BLYM inequality is verified (via the normalized matching property). AMS Classification: Primary 06A07. Secondary 06B25, 68R15.
منابع مشابه
Shortest path poset of finite Coxeter groups
We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group W from the identity to the longest word in W , w0. We show that this poset is the union of Boolean posets of rank absolute length of w0; that is, any shortest path labeled by reflections t1, . . . , tm is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in ...
متن کاملAn Analogue of the Thue-Morse Sequence
Abstract. We consider the finite binary words Z(n), n ∈ N defined by the following self-similar process: Z(0) := 0, Z(1) := 01, and Z(n+ 1) := Z(n) · Z(n− 1), where the dot · denotes word concatenation, and w the word obtained from w by exchanging the zeros and the ones. Denote by Z(∞) = 01110100 . . . the limiting word of this process, and by z(n) the nth bit of this word. This sequence z is a...
متن کاملDeciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the poset loses. Polynomial time algorithms exist for certain restricted classes of poset games, such as the game of Nim. However, until recently the complexity...
متن کاملThe Complexity of the Extendibility Problem for Finite Posets
For a finite poset P let EXT(P ) denote the following decision problem. Given a finite poset Q and a partial map f from Q to P , decide whether f extends to a monotone total map from Q to P . It is easy to see that EXT(P ) is in the complexity class NP. In [SIAM J. Comput., 28 (1998), pp. 57–104], Feder and Vardi define the classes of width 1 and of bounded strict width constraint satisfaction ...
متن کاملh-VECTORS OF GORENSTEIN* SIMPLICIAL POSETS
A simplicial poset P (also called a boolean poset and a poset of boolean type) is a finite poset with a smallest element 0̂ such that every interval [0̂, y] for y ∈ P is a boolean algebra, i.e., [0̂, y] is isomorphic to the set of all subsets of a finite set, ordered by inclusion. The set of all faces of a (finite) simplicial complex with empty set added forms a simplicial poset ordered by inclusi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001